Spanning subspace configurations

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Bijection Between the Recurrent Configurations of a Hereditary Chip-Firing Model and Spanning Trees

Hereditary chip-firing models generalize the Abelian sandpile model and the cluster firing model to an exponential family of games induced by covers of the vertex set. This generalization retains some desirable properties, e.g. stabilization is independent of firings chosen and each chip-firing equivalence class contains a unique recurrent configuration. In this paper we present an explicit bij...

متن کامل

Alternating Subspace-Spanning Resampling to Accelerate Markov Chain Monte Carlo Simulation

This article provides a simple method to accelerate Markov chain Monte Carlo sampling algorithms, such as the data augmentation algorithm and the Gibbs sampler, via alternating subspace-spanning resampling (ASSR). The ASSR algorithm often shares the simplicity of its parent sampler but has dramatically improved efŽ ciency. The methodology is illustrated with Bayesian estimation for analysis of ...

متن کامل

Spectro-temporal modulation subspace-spanning filter bank features for robust automatic speech recognition.

In an attempt to increase the robustness of automatic speech recognition (ASR) systems, a feature extraction scheme is proposed that takes spectro-temporal modulation frequencies (MF) into account. This physiologically inspired approach uses a two-dimensional filter bank based on Gabor filters, which limits the redundant information between feature components, and also results in physically int...

متن کامل

Subspace system identification

We give a general overview of the state-of-the-art in subspace system identification methods. We have restricted ourselves to the most important ideas and developments since the methods appeared in the late eighties. First, the basis of linear subspace identification are summarized. Different algorithms one finds in literature (Such as N4SID, MOESP, CVA) are discussed and put into a unifyin...

متن کامل

Isotropic Constant Dimension Subspace Codes

 In network code setting, a constant dimension code is a set of k-dimensional subspaces of F nq . If F_q n is a nondegenerated symlectic vector space with bilinear form f, an isotropic subspace U of F n q is a subspace that for all x, y ∈ U, f(x, y) = 0. We introduce isotropic subspace codes simply as a set of isotropic subspaces and show how the isotropic property use in decoding process, then...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Selecta Mathematica

سال: 2021

ISSN: 1022-1824,1420-9020

DOI: 10.1007/s00029-021-00617-6